Generating normal numbers over Gaussian integers
نویسنده
چکیده
In this paper we consider normal numbers over Gaussian integers generated by polynomials. This corresponds to results by Nakai and Shiokawa in the case of real numbers. A generalization of normal numbers to Gaussian integers and their canonical number systems, which were characterized by Kátai and Szabó, is given. With help of this we construct normal numbers of the form 0. bf(z1)c bf(z2)c bf(z3)c bf(z4)c bf(z5)c bf(z6)c . . . Here we denote by bxc the expansion of the integer part of x with respect to a given number system in Z[i], by f we denote a polynomial with complex coefficients, and by zi we denote a numbering of the Gaussian integers. We are able to show, that a number, which is constructed in this way, is normal to the given number system.
منابع مشابه
ASYMPTOTIC NORMALITY OF b-ADDITIVE FUNCTIONS ON POLYNOMIAL SEQUENCES IN THE GAUSSIAN NUMBER FIELD
0. Notations Throughout the paper we use the following notations: We write e(z) = e; C, R, Q, Z, N and N0, denote the set of complex numbers, real numbers, rational numbers, integers, positive integers, and positive integers including zero, respectively. Q(i) denotes the field of Gaussian numbers, and Z[i] the ring of Gaussian integers. We write tr(z) and N(z) for the trace and the norm of z ov...
متن کاملPerfect Gaussian Integer Sequences From Binary Idempotents
Gaussian integers are the complex numbers whose real and imaginary parts are both integers. Recently, Gaussian integer sequences with ideal autocorrelation, called the perfect Gaussian integer sequences, have been extensively used in codedivision multiple-access and orthogonal frequencydivision multiplexing (OFDM) systems. In this paper, binary idempotent is utilized to generate a set of intege...
متن کاملOn the distribution of M-tuples of B-numbers
In the classical sense, the set B consists of all integers which can be written as a sum of two perfect squares. In other words, these are the values attained by norms of integral ideals over the Gaussian field Q(i) . G.J. Rieger (1965) and T. Cochrane / R.E. Dressler (1987) established bounds for the number of pairs (n, n+h) , resp., triples (n, n+1, n+2) of B -numbers up to a large real param...
متن کاملGaussian Integers 1 Yuichi Futa Japan Advanced Institute of Science and Technology Ishikawa , Japan Hiroyuki Okazaki
Gaussian integer is one of basic algebraic integers. In this article we formalize some definitions about Gaussian integers [27]. We also formalize ring (called Gaussian integer ring), Z-module and Z-algebra generated by Gaussian integer mentioned above. Moreover, we formalize some definitions about Gaussian rational numbers and Gaussian rational number field. Then we prove that the Gaussian rat...
متن کاملSecurity Systems Based on Gaussian Integers : Analysis of Basic Operations and Time Complexity of Secret Transformations
SECURITY SYSTEMS BASED ON GAUSSIAN INTEGERS: ANALYSIS OF BASIC OPERATIONS AND TIME COMPLEXITY OF SECRET TRANSFORMATIONS by Aleksey Koval Many security algorithms currently in use rely heavily on integer arithmetic modulo prime numbers. Gaussian integers can be used with most security algorithms that are formulated for real integers. The aim of this work is to study the benefits of common securi...
متن کامل